Positive Fragments of Coalgebraic Logics
نویسندگان
چکیده
Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem, which not only gives a conceptual proof based on duality theory, but also generalizes Dunn’s result from Kripke frames to coalgebras for weak-pullback preserving functors. To facilitate this analysis we prove a number of category theoretic results on functors on the categories Set of sets and Pos of posets: Every functor Set → Pos has a Pos-enriched left Kan extension Pos → Pos. Functors arising in this way are said to have a presentation in discrete arities. In the case that Set → Pos is actually Set-valued, we call the corresponding left Kan extension Pos → Pos its posetification. A set functor preserves weak pullbacks if and only if its posetification preserves exact squares. A Pos-functor with a presentation in discrete arities preserves surjections. The inclusion Set → Pos is dense. A functor Pos → Pos has a presentation in discrete arities if and only if it preserves coinserters of ‘truncated nerves of posets’. A functor Pos → Pos is a posetification if and only if it preserves coinserters of truncated nerves of posets and discrete posets. A locally monotone endofunctor of an ordered variety has a presentation by monotone operations and equations if and only if it preserves Pos-enriched sifted colimits. 2012 ACM CCS: [Theory of computation]: Logic.
منابع مشابه
Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics
While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of...
متن کاملFlat Coalgebraic Fixed Point Logics
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the μ-calculus. The family of such flat fixed po...
متن کاملCanonical Coalgebraic Linear Time Logics
We extend earlier work on linear time fixpoint logics for coalgebras with branching, by showing how propositional operators arising from the choice of branching monad can be canonically added to these logics. We then consider two semantics for the uniform modal fragments of such logics: the previously-proposed, step-wise semantics and a new semantics akin to those of path-based logics. We prove...
متن کاملOn the Fusion of Coalgebraic Logics
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to transfer from the component logics to their fusion. In this paper we investigate to what extent these results can be generalised to the case of arbitrary coalgebraic logics. Our main result generalises a construction of Kr...
متن کاملCoLoSS : The Coalgebraic Logic Satisfiability Solver ( System Description ) Georgel Calin
CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...
متن کاملOn Logics for Coalgebraic Simulation
We investigate logics for coalgebraic simulation from a compositional perspective. Specifically, we show that the expressiveness of an inductively-defined language for coalgebras w.r.t. a given notion of simulation comes as a consequence of an expressivity condition between the language constructor used to define the language for coalgebras, and the relator used to define the notion of simulati...
متن کامل